Graph representation of context-free grammars
نویسنده
چکیده
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations for CF-grammars. Furthermore, graph are well adapted to various extensions (one kind of such extensions being attributes). This paper describes a class of graphs corresponding to CF-grammars – the decision-making graphs (henceforth abbreviated as DMG).
منابع مشابه
Uniform Random Generation of Graphs with Graph Grammars
The aim of the project is to develop a graph generator that provides users with a powerful method to specify graph classes from which the generated graphs are drawn. This is achieved by adapting a method for string generation over context-free grammars to hyperedge replacement grammars, and implementing this method in Scala.
متن کاملSyntactic Processing of Diagrams by Graph Grammars
We deal with syntactic definitions and processing of program diagrams based on graph grammars with respect to the mechanical drawing. We propose an attribute NCE graph grammar of hierarchical diagrams such as structured program diagrams. We also propose attribute context-free and context-sensitive NCE graph grammars for nested and tessellation diagrams, respectively. Attribute rules are used fo...
متن کاملAbout Graph and Hypergraph Context Free Grammars
The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent. Key-Words: Hyperedge Replac...
متن کاملBisimulation of Context-free Grammars and of Pushdown Automata
We consider the bisimulation on the transition graphs of pushdown automata. First we give a characterization of bisimulation using the unfolded trees. We recall that the bisimulation is decidable for the subclass of preex transition graphs of context-free grammars. Furthermore any pushdown transition graph is a regular graph: it can be generated by iterated parallel rewritings of a deterministi...
متن کاملSimilarities Between String Grammars and Graph Grammars
In this paper, we present some studies about relations existing between well known Chomsky string grammars and graph grammars, in particularly hypergraph grammars. We are discussing about deterministic context free Lindenmayer Systems used to describe commands to a device that generates black and white digital images. Instead of well-known methods of drawing, we will paint squares, not lines. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0703015 شماره
صفحات -
تاریخ انتشار 2006